Note on Bonelli's “Tableau Synoptique.”
نویسندگان
چکیده
منابع مشابه
Note on the Tableau Technique for Commutative Transition Systems
We define a class of transition systems called effective commutative transition systems (ECTS) and show, by generalising a tableaubased proof for BPP, that strong bisimilarity between any two states of such a transition system is decidable. It gives a general technique for extending decidability borders of strong bisimilarity for a wide class of infinite-state transition systems. This is demons...
متن کاملTableau Recycling
In this paper we improve a model checking algorithm based on the tableau method of Stifling and Walker. The algorithm proves whether a property expressed in the modal mu-calculus holds for a state in a finite transition system. It makes subsequent use of subtableaux which were calculated earlier in the proof run. These aubtab|eaux are reduced to expressions. Examples show that both size of tabl...
متن کاملOn Selecting a Random Shifted Young Tableau
The study of standard and generalized Young tableaux has led to interesting results in quite a number of areas of mathematics. These arrays are of importance in the representation theory of the symmetric and general linear groups [12], in invariant theory [7], and in connection with various combinatorial problems [ 11. In addition, many algorithms have been developed that manipulate the tableau...
متن کاملOn Enumerating Query Plans Using Analytic Tableau
We consider how the method of analytic tableau coupled with interpolant extraction can be adapted to enumerate possible query plans for a given user query in the context of a first order theory that defines a relational database schema. In standard analytic tableau calculi, the sub-formula property of proofs limits the variety of interpolants and consequently of plans that can be generated for ...
متن کاملProlog Extensions Based on Tableau Calculus
The intention of this paper is to help bridging the gap between logic programming and theorem proving. It presents the design of a Gentzen type proof search procedure, based on classical tableau calculus, for knowledge bases consisting of arbitrary first order formulas. At each proof search step, when a new formula is to be chosen from the knowledge base, the procedure chooses in such a way tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Royal Entomological Society of London
سال: 2009
ISSN: 0035-8894
DOI: 10.1111/j.1365-2311.1919.tb00004.x